Quasi-kernels and quasi-sinks in infinite graphs

نویسندگان

  • Péter L. Erdös
  • Lajos Soukup
چکیده

Given a directed graph G = (V, E) an independent set A ⊂ V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed graph has a quasikernel. The plain generalization for infinite graphs fails, even for tournaments. We investigate the following conjecture here: for any digraph G = (V, E) there is a a partition (V0, V1) of the vertex set such that the induced subgraph G[V0] has a quasi-kernel and the induced subgraph G[V1] has a quasi-sink.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smaller Parameters for Vertex Cover Kernelization

We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str{\o}mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a vertex set such that each connected component of $G-X$ contains at most one cycle, i.e., $X$ is a modulator to a pseudoforest. We strongly generalize this re...

متن کامل

Well-quasi-ordering H-contraction-free graphs

A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we give a complete characterization of graphs H such that the class of H-contraction-free graphs is well-quasi-ordered by the contraction relation. This result is...

متن کامل

Well-quasi-ordering Infinite Graphs with Forbidden Finite Planar Minor

We prove that given any sequence G\, Gi,... of graphs, where G\ is finite planar and all other G, are possibly infinite, there are indices ;', j such that i < j and G¡ is isomorphic to a minor of Gj . This generalizes results of Robertson and Seymour to infinite graphs. The restriction on G\ cannot be omitted by our earlier result. The proof is complex and makes use of an excluded minor theorem...

متن کامل

Optimization of infinite composite plates with quasi-triangular holes under in-plane loading

This study used particle swarm optimization (PSO) to determine the optimal values of effective design variables acting on the stress distribution around a quasi-triangular hole in an infinite orthotropic plate. These parameters were load angle, hole orientation, bluntness, fiber angle, and material properties, which were ascertained on the basis of an analytical method used by Lekhnitskii [3]. ...

متن کامل

On the existence of (k, l)-kernels in infinite digraphs: A survey

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N , u 6= v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k− 1)-kernel. This work is a survey of results proving sufficient conditions for the exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2009